n,m=map(int,input().split())
if(n==m and n==1):
print(n)
elif(m-1>=n-m):
print(m-1)
else:
print(m+1)#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector < ll > vl;
typedef set < ll > setl;
#define FOR(i, n) for(ll i = 1; i <= n; i++)
#define FORI(i, n) for(ll i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define forr(it, m) for(auto it = m.begin(); it != m.end(); it++)
#define sync \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define arr(a,n) for(ll i=1;i<=n;i++) cout<<a[i]<<" "; cout << "\n";
#define vecc(a,n) for(ll i=0;i<n;i++) cout<<a[i]<<" "; cout << "\n";
#define COUT(n, a) cout<< fixed << setprecision(a) << n<<endl
int main(){
sync;
int t = 1;
//cin >> t;
while(t--){
int n, m, k;
cin >> n >> m;
k = n / 2;
if(n == 1 && m == 1)cout << 1;
else if(k < m)cout<< m - 1;
else cout << m + 1;
}
}622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |